A Note on Infinite Antichain Density

نویسندگان

چکیده

Let $\mathcal{F}$ be an antichain of finite subsets $\mathbb{N}$. How quickly can the quantities $|\mathcal{F}\cap 2^{[n]}|$ grow as $n\to\infty$? We show that for any sequence $(f_n)_{n\ge n_0}$ positive integers satisfying $\sum_{n=n_0}^\infty f_n/2^n \le 1/4$, $f_{n_0}=1$ and $f_n\le f_{n+1}\le 2f_n$, there exists infinite $\mathbb{N}$ such 2^{[n]}| \geq f_n$ all $n\ge n_0$. It follows $\varepsilon>0$ $\mathcal{F}\subseteq 2^\mathbb{N}$ $$\liminf_{n \to \infty} |\mathcal{F}\cap \cdot \left(\frac{2^n}{n\log^{1+\varepsilon} n}\right)^{-1} > 0.$$ This resolves a problem Sudakov, Tomon Wagner in strong form, is essentially tight.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Infinite Antichain of Permutations

We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain.

متن کامل

a note on fixed points of automorphisms of infinite groups

‎motivated by a celebrated theorem of schur‎, ‎we show that if~$gamma$ is a normal subgroup of the full automorphism group $aut(g)$ of a group $g$ such that $inn(g)$ is contained in $gamma$ and $aut(g)/gamma$ has no uncountable abelian subgroups of prime exponent‎, ‎then $[g,gamma]$ is finite‎, ‎provided that the subgroup consisting of all elements of $g$ fixed by $gamma$ has finite index‎. ‎so...

متن کامل

A note on | A | k summability factors of infinite series

A weighted mean matrix, denoted by (N , pn), is a lower triangular matrix with entries pk/Pn, where {pk} is a nonnegative sequence with p0 > 0, and Pn := ∑n k=0 pk. Mishra and Srivastava [1] obtained sufficient conditions on a sequence {pk} and a sequence {λn} for the series ∑ anPnλn/npn to be absolutely summable by the weighted mean matrix (N , pn). Bor [2] extended this result to absolute sum...

متن کامل

Note on vertex-partitions of infinite graphs

Let G be a (finite or infinite) graph with vertex set V(G) and edge set E(G). A partition P = {vi: i E Z} of V(G) is called a k-partition if [Vi1 s k for every i E I. Let the graph Gp be defined by (i) V(Gp) = {vi: i E Z}, (ii) l$l$ E E(G,)exy E (G) for some x E l$, y E l$ (i #j). Given an infinite graph G, let deg,(G) denote the least d for which there exist a natural number k and a k-partitio...

متن کامل

On the flat antichain conjecture

We present partial results on the Flat Antichain Conjecture. In particular, we prove that the conjecture is true when the average size of the edges is an integer.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Discrete Mathematics

سال: 2022

ISSN: ['1095-7146', '0895-4801']

DOI: https://doi.org/10.1137/21m143025x